Topologically sweeping visibility complexes via pseudotriangulations
نویسندگان
چکیده
منابع مشابه
Topologically Sweeping Visibility Complexes via
This paper describes a new algorithm for constructing the set of free bitangents of a collection of n disjoint convex obstacles of constant complexity. The algorithm runs in time O(n log n + k), where k is the output size, and uses O(n) space. While earlier algorithms achieve the same optimal running time, this is the first optimal algorithm that uses only linear space. The visibility graph or ...
متن کاملComputing pseudotriangulations via branched coverings
We describe an efficient algorithm to compute a pseudotriangulation of a finite planar family of pairwise disjoint convex bodies presented by its chirotope. The design of the algorithm relies on a deepening of the theory of visibility complexes and on the extension of that theory to the setting of branched coverings. The problem of computing a pseudotriangulation that contains a given set of bi...
متن کاملMulti - pseudotriangulations
We introduce a natural generalization of both pseudotriangulations and multitriangulations, that we call multi-pseudotriangulations. We propose an enumeration algorithm for multi-pseudotriangulations, based on certain greedy multi-pseudotriangulations that are closely related with sorting networks. The proofs of the results of this extended abstract are skipped for space reasons.
متن کاملA 'sum of Squares' Theorem for Visibility Complexes a 'sum of Squares' Theorem for Visibility Complexes
We present a new and simpler method to implement in constant amortized time the ip operation of the so-called 'Greedy Flip Algorithm', an optimal algorithm to compute the visibility graph/complex of a collection of pairwise disjoint bounded convex sets of constant complexity. The method uses only the incidence structure of the visibility complex and only the primitive predicate which states tha...
متن کاملOn Constrained Minimum Pseudotriangulations
In this paper, we show some properties of a pseudotriangle and present three combinatorial bounds: the ratio of the size of minimum pseudotriangulation of a point set S and the size of minimal pseudotriangulation contained in a triangulation T , the ratio of the size of the best minimal pseudotriangulation and the worst minimal pseudotriangulation both contained in a given triangulation T , and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1996
ISSN: 0179-5376,1432-0444
DOI: 10.1007/bf02712876